Reasoning about Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin
نویسندگان
چکیده
We propose a nonmonotonic extension of low complexity Description Logics EL⊥ and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. Concerning DL-LitecTmin, we prove that entailment is in Πp2. With regard to EL⊥Tmin, we first show that entailment remains EXPTIME-hard. Next we consider the known fragment of Left Local EL⊥Tmin and we prove that the complexity of entailment drops to Πp2.
منابع مشابه
Preferential Low Complexity Description Logics: Complexity Results and Proof Methods
In this paper we describe an approach for reasoning about typicality and defeasible properties in low complexity preferential Description Logics. We describe the non-monotonic extension of the low complexity DLs EL and DL-Litecore based on a typicality operator T, which enjoys a preferential semantics. We summarize complexity results for such extensions, called EL⊥Tmin and DL-LitecTmin. Entailm...
متن کاملNonmonotonic extensions of low-complexity DLs: complexity results and proof methods
In this paper we propose nonmonotonic extensions of low complexity Description Logics EL and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. We summarize complexity results for such extensions recently studied. Entailment in DL-LitecTmin is in Π p 2 , whereas entailment in EL ⊥ Tmin is EXPTIMEhard. However, consider...
متن کاملReasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attention on the logic ALC. We present a nonmonotonic logic ALC + Tmin, which is built upon a monotonic logic ALC+T obtained by adding a typicality operator T to ALC. The operator T is intended to select the “most normal” o...
متن کاملA Tableau Calculus for a Nonmonotonic Extension of EL^\mathcal{EL}^\bot
We introduce a tableau calculus for a nonmonotonic extension of low complexity Description Logic EL that can be used to reason about typicality and defeasible properties. The calculus deals with Left Local knowledge bases in the logic EL⊥Tmin recently introduced in [8] . The calculus performs a twophase computation to check whether a query is minimally entailed from the initial knowledge base. ...
متن کاملReasoning about Typicality in Preferential Description Logics
In this paper we propose a nonmonotonic extension ALC + Tmin of the Description Logic ALC for reasoning about prototypical properties and inheritance with exception. The logic ALC + Tmin is built upon a previously introduced (monotonic) logic ALC + T, that is obtained by adding a typicality operator T to ALC. The operator T is intended to select the “most normal” or “most typical” instances of ...
متن کامل